Secure Multipary Computation
ثبت نشده
چکیده
Assume a number of parties want to compute a public function F (x1, . . . , xn) = (y1, . . . , yn). All of them want to get the correct answer, but none of them are willing to expose their secret inputs to other parties. One way to achieve this requirement is to implement the secure multiparty computation protocols. In this paper, we will make a brief introduction of secure multiparty computation and secret sharing schemes, and discuss the multiparty computation protocol of semi-honest adversary case in detail.
منابع مشابه
Design and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملپروتکل کارا برای جمع چندسویه امن با قابلیت تکرار
In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...
متن کاملSecure Computation on Mobile Devices
Secure two-party computation has been an interesting theoretical concept for decades, but until recently has been considered too expensive for practical applications. With significant advances in the design and implementation of secure protocols, secure computation is becoming feasible in practice. However, with the notable exceptions of biometric identification and secure auctions, the researc...
متن کاملSecure Multi-Party Computation (Excerpts of Chapter 2)
3 Secure Multi-Party Computation 2 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.1.1 Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.1.2 Security Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Passively Secure Multi-Party Computation . . . . . . . . . . . . . . . . . . . ...
متن کاملSecure Two-Party Computation: Generic Approach and Exploiting Specific Properties of Functions Approach
Introduced by Yao in early 1980s, secure computation is being one among the major area of research interest among cryptologists. In three decades of its growth, secure computation which can be called as two-party computation, or multiparty computation depending on the number of parties involved has experienced vast diversities. Research has been carried out by exploiting specific properties of ...
متن کامل